Reconstructing minimal rooted trees
نویسندگان
چکیده
منابع مشابه
Reconstructing Minimal Rooted Trees
For a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of the minor-minimal trees that are compatible with T . The running time of this algorithm is polynomial up to the number of trees with this property. This type of problem arises in several areas of classification, particularly evolutionary biology.
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملCounting Rooted Trees
Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence; for most of these a simple test can be used to quickly show that the form of the asymptotics is the same as that for the class of rooted trees: C · ρ−n · n−3/...
متن کاملCounting Rooted Trees 3
Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence; for most of these a simple test can be used to quickly show that the form of the asymptotics is the same as that for the class of rooted trees: C · ρ−n · n−3/...
متن کاملAn Arithmetic for Rooted Trees
We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication, and stretch, prove their properties, and show that all trees can be generated from a starting tree of one vertex. We then show how a given tree can be obtained as the sum or product of two trees, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00250-0